Risk Assessment and Vulnerable Path in Security Networks Based on Neyman-Pearson Criterion and Entropy
نویسندگان
چکیده
In this paper, the protection coverage area of a security system is considered. The protection coverage is determined by applying the protection model of security systems, which is brought forward according to Neyman-Pearson Criterion. The protection model can be used to define the protection probability on a grid-modeled field. The security systems deployed in a guard field are regarded abstractly as a diagram. On the basis of the entropy theory, we propose the risk entropy, which can be used to quantificationally evaluate the risk of arbitrary position in an area. Using a graph model for perimeter, we use Dijkstra's shortest path algorithm to find protection breach paths. The protection probability on the vulnerable path is considered as the risk measure of a security network. Furthermore, we study the effects of some parameters on the risk and the breach protection probability and present simulations. Ultimately, we can gain insight about the risk of a security network.
منابع مشابه
Radar detection with the Neyman-Pearson criterion using supervised-learning-machines trained with the cross-entropy error
The application of supervised learning machines trained to minimize the Cross-Entropy error to radar detection is explored in this article. The detector is implemented with a learning machine that implements a discriminant function, which output is compared to a threshold selected to fix a desired probability of false alarm. The study is based on the calculation of the function the learning mac...
متن کاملEntropy-based Serviceability Assessment of Water Distribution Networks, Subjected to Natural and Man-Made Hazards
In this study a modified entropy-based measure is presented for evaluating the serviceability level of water distribution networks in which the hydraulic uncertainties (flow rates in pipes) as well as the uncertainties due to mechanical parameters (failure probabilities of links) are considered simultaneously. In the proposed entropy calculation method, the connectivity order of the network dem...
متن کاملOptimum Local Decision Rules in a Distributed Detection System with Dependent Observations
The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملOptimum Local Decision Rules in a Distributed Detection System with Dependent Observations
The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...
متن کامل